The Window Distribution of Idealized TCP Congestion Avoidance with Variable Packet Loss

نویسندگان

  • Archan Misra
  • Teunis J. Ott
چکیده

This paper analyzes the stationary behavior of the TCP congestion window performing ideal congestion avoidance when the packet loss probability is not constant, but varies as a function of the window size. By neglecting the detailed window behavior during fast recovery, we are able to derive a Markov process that is then approximated by a continuous-time, continuous state-space process. The stationary distribution of this process is analyzed and derived numerically and then extrapolated to obtain the stationary distribution of the TCP window. This numerical analysis enables us to predict the behavior of the TCP congestion window when interacting with a router port performing Early Random Drop (or Random Early Detection) where the loss probability varies with the queue occupancy. Keywords—TCP, distribution, variable, loss.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The stationary behavior of ideal TCP congestion avoidance

This note derives the stationary behavior of idealized TCP congestion avoidance. More speci cally, it derives the stationary distribution of the congestion window size if loss of packets are independent events with equal probability. The mathematical derivation uses a uid ow, continuous time, approximation to the discrete time process (Wn), where Wn is the congestion window after the n-th packe...

متن کامل

The stationary behavior of ideal TCP congestionavoidanceTeunis

This note derives the stationary behavior of idealized TCP congestion avoidance. More speciically, it derives the stationary distribution of the congestion window size if loss of packets are independent events with equal probability. The mathematical derivation uses a uid ow, continuous time, approximation to the discrete time process (W n), where W n is the congestion window after the n-th pac...

متن کامل

Markov Processes with State-Dependent Failure Rates and Application to RED and TCP Window Dynamics

This paper presents a mathematical technique for computing the stationary distribution of Markov processes that evolve deterministically between arbitrarily distributed ‘failure events’. The key innovation in this paper is the use of a state-dependent time re-scaling technique, such that the re-scaled process can be described by a Poisson-interrupted stochastic differential equation. This techn...

متن کامل

On Buffer Limited Congestion Window Dynamics and Packet Loss

Recently, a lot of study has been carried out to clarify the dynamics of TCP congestion control mechanism. The congestion window distribution of idealized TCP has been investigated with constant packet loss in [1] and with variable packet loss in [2]. Average window size and throughput have been calculated in [3–5]. A stochastic Ito calculus has been developed in [6]. These studies considered p...

متن کامل

Tcp Congestion Avoidance Using Explicit Buffer Notification

This paper proposes to modify the TCP congestion control mechanism by allowing network routers to supply Explicit Buffer Notification (EBN) to the TCP data sender. The TCP sender runs an algorithm that uses the EBN feedback to compute the control window. The EBN plays the role of a generalized Advertised Window so that the EBN TCP results to be a natural extension of the current TCP flow contro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999